Exact real arithmetic using centred intervals and bounded error terms
نویسندگان
چکیده
منابع مشابه
Exact real arithmetic using centred intervals and bounded error terms
Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on these approximations with optimal or near optimal results. Bounds for the loss in quality of approximations for each of the field operations are also given. These approximations can be used as a more efficient alternativ...
متن کاملExact Real Arithmetic with Automatic Error
The common approach to real arithmetic on computers is floating point arithmetic, which can produce erroneous results due to roundoff errors. An alternative is exact real arithmetic and in this project such arithmetic is implemented in the well-known computer system Mathematica by the use of constructive real numbers. All basic operations are implemented as well as the common elementary functio...
متن کاملExact Real Arithmetic ?
One possible approach to exact real arithmetic is to use linear fractional transformations to represent real numbers and computations on real numbers. We show how to determine the digits that can be emitted from a transformation, and present a criterion which ensures that it is possible to emit a digit. Using these results, we prove that the obvious algorithm to compute n digits from the applic...
متن کاملConstraint Arithmetic on Real Intervals
Constraint interval arithmetic is a sublanguage of BNR Prolog which o ers a new approach to the old problem of deriving numerical consequences from algebraic models. Since it is simultaneously a numerical computation technique and a proof technique, it bypasses the traditional dichotomy between (numeric) calculation and (symbolic) proofs. This interplay between proof and calculation can be used...
متن کاملHardware-Accelerated Collision Detection using Bounded-Error Fixed-Point Arithmetic
A novel approach for highly space-efficient hardware-accelerated collision detection is presented. This paper focuses on the architecture to traverse bounding volume hierarchies in hardware. It is based on a novel algorithm for testing discretely oriented polytopes (DOPs) for overlap, utilizing only fixed-point (i.e., integer) arithmetic. We derive a bound on the deviation from the mathematical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2006
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2005.07.002